Implementation and performance evaluation of parallel FFT algorithms

Fast Fourier Transform (FFT) algorithms are widely used in many areas of science and engineering. Some of the most widely known FFT algorithms are Radix-2 algorithm, Radix-4 algorithm, Split Radix algorithm, Fast Hartley transformation based algorithm and Quick Fourier transform. In this paper, the first three algorithms listed are implemented in the sequential and MPI (message passing interface) parallel forms and their performances are compared. The algorithms are implemented in two parallel styles of algorithms such that we reduce communication overhead. We also see the effect of the inter-connection network on the performance of the algorithms.